Asymptotic enumeration of non-uniform linear hypergraphs
نویسندگان
چکیده
منابع مشابه
Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For n ≥ 3, let r = r(n) ≥ 3 be an integer and let k = (k1, . . . , kn) be a vector of nonnegative integers, where each kj = kj(n) may depend on n. Let M = M(n) = ∑n j=1 kj for all n ≥ 3, and define the set I = {n ≥ 3 | r(n) divides ...
متن کاملAsymptotic enumeration of sparse uniform hypergraphs with given degrees
Let r ≥ 2 be a fixed integer. For infinitely many n, let k = (k1, . . . , kn) be a vector of nonnegative integers such that their sum M is divisible by r. We present an asymptotic enumeration formula for simple r-uniform hypergraphs with degree sequence k. (Here “simple” means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree kmax...
متن کاملEnumeration of Connected Uniform Hypergraphs
In this paper, we are concerned in counting exactly and asymptotically connected labeled b-uniform hypergraphs (b ≥ 3). Enumerative results on connected graphs are generalized here to connected uniform hypergraphs. For this purpose, these structures are counted according to the number of vertices and hyperedges. First, we show how to compute step by step the associated exponential generating fu...
متن کاملCovering Non-uniform Hypergraphs
A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) denote the cardinality of a minimum cover in the hypergraph H , and let us denote by g(n) the maximum of τ(H) taken over all hypergraphs H with n vertices and with no two hyperedges of the same size. We show that g(n) < 1.98 √ n(1 + o(1)). A special case corresponds to an old problem of Erdős asking the ma...
متن کاملChromatic Coefficients of Linear Uniform Hypergraphs
A simple hypergraph H=(X, E), with order |X| and size m=|E|, consists of a vertex-set V(H)=X and an edge-set E(H)=E, where E X and |E| 2 for each edge E in E. H is linear if no two edges intersect in more than one vertex, and H is h-uniform, or is an h-hypergraph, if |E|=h for each E in E. The number of edges containing a vertex x is its degree dH(x). Two vertices u, v of H are in the same comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2019
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2246